Probabilistic Opponent-Model Search in Bao
نویسندگان
چکیده
In Probabilistic Opponent-Model search(PrOM search) the opponent is modelled by a mixed strategy of N opponent types ω0 . . . ωN−1. The opponent is assumed to adopt at every move one of the opponent types ωi according to the probability Pr(ωi). We hypothesize that PrOM search is a better search mechanism than Opponent-Model search (OM search) and Minimax search. In this paper we investigate two questions: (1) to which extent is PrOM search better than OM search and Minimax search in the game of Bao? and (2) which opponent type is most advantageous to use? To answer the second question we constructed five evaluation functions which we applied in a tournament consisting of 352,000 games. Our conclusions are twofold: (1) in Bao, PrOM search performs better than OM search and sometimes also better than Minimax search even when no perfect information of the opponent is available, and (2) for an adequate performance of PrOM search, emphasis on the own evaluation function in the opponent model should be higher than
منابع مشابه
DESIGN OF MINIMUM SEEPAGE LOSS IRRIGATION CANAL SECTIONS USING PROBABILISTIC SEARCH
To ensure efficient performance of irrigation canals, the losses from the canals need to be minimized. In this paper a modified formulation is presented to solve the optimization model for the design of different canal geometries for minimum seepage loss, in meta-heuristic environment. The complex non-linear and non-convex optimization model for canal design is solved using a probabilistic sear...
متن کاملProbabilistic Power Distribution Planning Using Multi-Objective Harmony Search Algorithm
In this paper, power distribution planning (PDP) considering distributed generators (DGs) is investigated as a dynamic multi-objective optimization problem. Moreover, Monte Carlo simulation (MCS) is applied to handle the uncertainty in electricity price and load demand. In the proposed model, investment and operation costs, losses and purchased power from the main grid are incorporated in the f...
متن کاملA Probabilistic Model for Fine-Grained Expert Search
Expert search, in which given a query a ranked list of experts instead of documents is returned, has been intensively studied recently due to its importance in facilitating the needs of both information access and knowledge discovery. Many approaches have been proposed, including metadata extraction, expert profile building, and formal model generation. However, all of them conduct expert searc...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملProb-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost of modeling. Opponent modeling solutions simply cannot search as deep as the highly optimized minimax search with alpha-beta pruning. Recent work has begun to look at the need for opponent modeling in n-player or gener...
متن کامل